A testing scenario for probabilistic automataSTOELINGA, Mariëlle; VAANDRAGER, Frits.Lecture notes in computer science. 2003, pp 464-477, issn 0302-9743, isbn 3-540-40493-7, 14 p.Conference Paper

Compositionality for probabilistic automataLYNCH, Nancy; SEGALA, Roberto; VAANDRAGER, Frits et al.Lecture notes in computer science. 2003, pp 208-221, issn 0302-9743, isbn 3-540-40753-7, 14 p.Conference Paper

Realization of probabilistic automata : Categorical approachMATEUS, Paulo; SERNADAS, Amflcar; SERNADAS, Cristina et al.Lecture notes in computer science. 2000, pp 237-251, issn 0302-9743, isbn 3-540-67898-0Conference Paper

Symbolic model checking for probabilistic processesBAIER, C; CLARKE, E. M; HARTONAS-GARMHAUSEN, V et al.Lecture notes in computer science. 1997, pp 430-440, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Identification of probabilistic cellular automataADAMATSKIY, A. I.Soviet journal of computer and systems sciences. 1992, Vol 30, Num 3, pp 118-123, issn 0882-4002Article

Decision algorithms for probabilistic bisimulationCATTANI, Stefano; SEGALA, Roberto.Lecture notes in computer science. 2002, pp 371-385, issn 0302-9743, isbn 3-540-44043-7, 15 p.Conference Paper

On the class of languages recognizable by 1-way quantum finite automataAMBAINIS, Andris; KIKUSTS, Arnolds; VALDATS, Maris et al.Lecture notes in computer science. 2001, pp 75-86, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Verification of parameterized systems by dynamic induction on diagramsMANNA, Z; SIPMA, H. B.Lecture notes in computer science. 1999, pp 25-43, issn 0302-9743, isbn 3-540-66202-2Conference Paper

A time complexity gap for two-way probabilistic finite-state automataDWORK, C; STOCKMEYER, L.SIAM journal on computing (Print). 1990, Vol 19, Num 6, pp 1011-1023, issn 0097-5397, 13 p.Conference Paper

Immunity and simplicity in relativizations of probabilistic complexity classesBALCAZAR, J. L; RUSSO, D. A.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 2, pp 227-244, issn 0988-3754Article

Probabilistic reversible automata and quantum automataGOLOVKINS, Marats; KRAVTSEV, Maksim.Lecture notes in computer science. 2002, pp 574-583, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Test generation derived from model-checkingJERON, T; MOREL, P.Lecture notes in computer science. 1999, pp 108-121, issn 0302-9743, isbn 3-540-66202-2Conference Paper

Enumeration of directed site animals on the decorated square latticesAGHA AFSAR ALI.Physica. A. 1994, Vol 202, Num 3-4, pp 520-528, issn 0378-4371Article

On 2PFA's and the Hadamard quotient of formal power seriesANSELMO, M; BERTONI, A.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 2, pp 165-173, issn 1370-1444Conference Paper

Wolfram's class IV automata and a good lifeMCINTOSH, H. V.Physica. D. 1990, Vol 45, Num 1-3, pp 105-121, issn 0167-2789Conference Paper

Cellular automata (Geneva, 9-11 October 2002)Bandini, Stefania; Chopard, Bastien; Tomassini, Marco et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-44304-5, XI, 367 p, isbn 3-540-44304-5Conference Proceedings

Axiomatizations for probabilistic bisimulationBANDINI, Emanuele; SEGALA, Roberto.Lecture notes in computer science. 2001, pp 370-381, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Probabilities to accept languages by quantum finite automataAMBAINIS, A; BONNER, R; FREIVALDS, R et al.Lecture notes in computer science. 1999, pp 174-183, issn 0302-9743, isbn 3-540-66200-6Conference Paper

The Domany-Kinzel cellular automaton phase diagramZEBENDE, G. F; PENNA, T. J. P.Journal of statistical physics. 1994, Vol 74, Num 5-6, pp 1273-1279, issn 0022-4715Article

Multivariable control of a liquid-liquid extraction column using a probabilistic automatonNAJIM, K.IEE proceedings. Part D. Control theory and applications. 1988, Vol 135, Num 6, pp 479-485, issn 0143-7054Article

Exploiting the difference in probability calculation between quantum and probabilistic computationsAMANO, Masami; IWAMA, Kazuo; RAYMOND H.P., Rudy et al.Lecture notes in computer science. 2002, pp 100-114, issn 0302-9743, isbn 3-540-44311-8, 15 p.Conference Paper

Learning Probabilistic Residual Finite State AutomataESPOSITO, Yann; LEMAY, Aurélien; DENIS, Francois et al.Lecture notes in computer science. 2002, pp 77-91, issn 0302-9743, isbn 3-540-44239-1, 15 p.Conference Paper

The complexity of probabilistic versus quantum finite automataMIDRIJANIS, Gatis.Lecture notes in computer science. 2002, pp 273-278, issn 0302-9743, isbn 3-540-00145-X, 6 p.Conference Paper

Universality class of probabilistic cellular automataMAKOWIEC, Danuta; GNACINSKI, Piotr.Lecture notes in computer science. 2002, pp 104-113, issn 0302-9743, isbn 3-540-44304-5, 10 p.Conference Paper

Bisimulation algorithms for stochastic process algebras and their BDD-based implementationHERMANNS, H; SIEGLE, M.Lecture notes in computer science. 1999, pp 244-264, issn 0302-9743, isbn 3-540-66010-0Conference Paper